skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Nahata, Valmik"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Counting and listing triangles in graphs is a fundamental task in network analysis, supporting applications such as community detection, clustering coefficient computation, k-truss decomposition, and triangle centrality. We introduce the cover-edge set, a novel concept that eliminates unnecessary edges during triangle enumeration, thereby improving efficiency. This compact cover-edge set is rapidly constructed using a breadth-first search (BFS) strategy. Using this concept, we develop both sequential and parallel triangle-counting algorithms and conduct comprehensive comparisons with state-of-the-art methods. We also design a benchmarking framework to evaluate our sequential and parallel algorithms in a systematic and reproducible manner. Extensive experiments on the latest Intel Xeon 8480+ processor reveal clear performance differences among algorithms, demonstrate the benefits of various optimization strategies, and show how graph characteristics, such as diameter and degree distribution, affect algorithm performance. Our source code is available on GitHub. 
    more » « less
    Free, publicly-accessible full text available November 1, 2026
  2. Abstract A small number of pulsars are known to emit giant pulses (GPs), single pulses much brighter than average. Among these is PSR J0534+2200, also known as the Crab pulsar, a young pulsar with high GP rates. Long-term monitoring of the Crab pulsar presents an excellent opportunity to perform statistical studies of its GPs and the processes affecting them, potentially providing insight into the behavior of other neutron stars that emit bright single pulses. Here, we present an analysis of a set of 24,985 Crab GPs obtained from 88 hr of daily observations at a center frequency of 1.55 GHz by the 20 m telescope at the Green Bank Observatory, spread over 461 days. We study the effects of refractive scintillation at higher frequencies than previous studies and compare methods of correcting for this effect. We also search for deterministic patterns seen in other single-pulse sources, possible periodicities seen in several rotating radio transients and fast radio bursts, and clustering of GPs like that seen in the repeating fast radio burst FRB 121102. 
    more » « less